Large multiple neighborhood search for the clustered vehicle-routing problem
نویسندگان
چکیده
منابع مشابه
An adaptive large neighborhood search for a vehicle routing problem with multiple routes
The vehicle routing problem with multiple trips consists in determining the routing of a fleet of vehicles where each vehicle can perform multiple routes during its workday. This problem is relevant in applications where the duration of each route is limited, for example when perishable goods are transported. In this work, we assume that a fixed-size fleet of vehicles is available and that it m...
متن کاملA matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
The vehicle routing problem with cross-docking (VRPCD) consists in defining a set of routes that satisfy transportation requests between a set of pickup points and a set of delivery points. The vehicles bring goods from pickup locations to a cross-docking platform, where the items may be consolidated for efficient delivery. In this paper we propose a new solution methodology for this problem. I...
متن کاملA Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows
This paper considers the VRP Problem with Soft Time-Windows (VRPSTW), a challenging routing problem due to its combination of hard time windows and a lexicographic objective function minimizing the number of vehicles, the violations of the soft time windows, and the total travel distance. The paper presents a multi-stage, variable neighborhood search algorithm for the VRPSTW, which uses the sam...
متن کاملA template-based adaptive large neighborhood search for the consistent vehicle routing problem
The consistent vehicle routing problem (ConVRP), as defined in [1], is an extension of the periodic vehicle routing problem. This problem category involves the construction of routes over a given time period, e.g several days, such that customer demands are met. However, a simple delivery is nowadays not enough for companies to differentiate themselves in a competitive environment. For this rea...
متن کاملA large neighborhood search algorithm for the vehicle routing problem with time windows
Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (vrptw) consists of determining a set of feasible routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total mileage. Each customer must be visited exactly once by a vehicle within a prescribed time interval. A route starts from the depot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2018
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2018.02.056